A non-differentiable approach to revenue equivalence

We give a sufficient condition on the type space for revenue equivalence when the set of social alternatives consists of probability distributions over a finite set. Types are identified with real-valued functions that assign valuations to elements of this finite set, and the type space is equipped with the Euclidean topology. Our sufficient condition is stronger than connectedness but weaker than smooth arcwise connectedness. Our result generalizes all existing revenue equivalence theorems when the set of social alternatives consists of probability distributions over a finite set. When the set of social alternatives is finite, we provide a necessary and sufficient condition. This condition is similar to, but slightly weaker than, connectedness.Revenue equivalence, mechanism design, incentive compatibility, non-differentiable approach, connected type space

Characterization of revenue equivalence

The property of an allocation rule to be implementable in dominant strategies by a unique payment scheme is called \emph{revenue equivalence}. In this paper we give a characterization of revenue equivalence based on a graph theoretic interpretation of the incentive compatibility constraints. The characterization holds for any (possibly infinite) outcome space and many of the known results are immediate consequences. Moreover, revenue equivalence can be identified in cases where existing theorems are silent

Auctions: Theory and Practice

Governments use them to sell everything from oilfields to pollution permits, and to privatize companies; consumers rely on them to buy baseball tickets and hotel rooms, and economic theorists employ them to explain booms and busts. Auctions make up many of the world's most important markets; and this book describes how auction theory has also become an invaluable tool for understanding economics. Auctions: Theory and Practice provides a non-technical introduction to auction theory, and emphasises its practical application. Although there are many extremely successful auction markets, there have also been some notable fiascos, and Klemperer provides many examples. He discusses the successes and failures of the one-hundred-billion dollar "third-generation" mobile-phone license auctions; he, jointly with Ken Binmore, designed the first of these. Klemperer also demonstrates the surprising power of auction theory to explain seemingly unconnected issues such as the intensity of different forms of industrial competition, the costs of litigation, and even stock trading 'frenzies' and financial crashes. Engagingly written, the book makes the subject exciting not only to economics students but to anyone interested in auctions and their role in economics.markets, industrial competition, litigation, stock trading, financial crashes

Characterization of Revenue Equivalence

The property of an allocation rule to be implementable in dominant strategies by a unique payment scheme is called revenue equivalence. In this paper we give a characterization of revenue equivalence based on a graph theoretic interpretation of the incentive compatibility constraints. The characterization holds for any (possibly infinite) outcome space and many of the known results are immediate consequences. Moreover, revenue equivalence can be identified in cases where existing theorems are silent.computer science applications;

Two Classes of Cooperative Games Related to One-Object Auction Situations

AMS classifications; 91A12; 90B05;market games;ring games;one-object auction situations;big boss games;peer group games

Moving from Data-Constrained to Data-Enabled Research: Experiences and Challenges in Collecting, Validating and Analyzing Large-Scale e-Commerce Data

Widespread e-commerce activity on the Internet has led to new opportunities to collect vast amounts of micro-level market and nonmarket data. In this paper we share our experiences in collecting, validating, storing and analyzing large Internet-based data sets in the area of online auctions, music file sharing and online retailer pricing. We demonstrate how such data can advance knowledge by facilitating sharper and more extensive tests of existing theories and by offering observational underpinnings for the development of new theories. Just as experimental economics pushed the frontiers of economic thought by enabling the testing of numerous theories of economic behavior in the environment of a controlled laboratory, we believe that observing, often over extended periods of time, real-world agents participating in market and nonmarket activity on the Internet can lead us to develop and test a variety of new theories. Internet data gathering is not controlled experimentation. We cannot randomly assign participants to treatments or determine event orderings. Internet data gathering does offer potentially large data sets with repeated observation of individual choices and action. In addition, the automated data collection holds promise for greatly reduced cost per observation. Our methods rely on technological advances in automated data collection agents. Significant challenges remain in developing appropriate sampling techniques integrating data from heterogeneous sources in a variety of formats, constructing generalizable processes and understanding legal constraints. Despite these challenges, the early evidence from those who have harvested and analyzed large amounts of e-commerce data points toward a significant leap in our ability to understand the functioning of electronic commerce.Comment: Published at http://dx.doi.org/10.1214/088342306000000231 in the Statistical Science (http://www.imstat.org/sts/) by the Institute of Mathematical Statistics (http://www.imstat.org

How (not) to raise money

We show that standard winner-pay auctions are inept fund-raising mechanisms because of the positive externality bidders forgo if they top another's high bid. Revenues are suppressed as a result and remain finite even when bidders value a dollar donated the same as a dollar kept. This problem does not occur in lotteries and all-pay auctions, where bidders pay irrespective of whether they win. We introduce a general class of all-pay auctions, rank their revenues, and illustrate how they dominate lotteries and winner-pay formats. The optimal fund-raising mechanism is an all-pay auction augmented with an entry fee and reserve price

Dynamic Auctions: A Survey

We survey the recent literature on designing auctions and mechanisms for dynamic settings. Two settings are considered: those with a dynamic population of agents or buyers whose private information remains fixed throughout time; and those with a fixed population of agents or buyers whose private information changes across time. Within each of these settings, we discuss both efficient (welfare-maximizing) and optimal (revenue-maximizing) mechanisms.Dynamic auctions and mechanisms, Random arrivals and departures, Changing private information, Incentive compatibility